PRIME KNOTS WHOSE ARC INDEX IS SMALLER THAN THE CROSSING NUMBER

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Crossing Number of Knots

The aim of this paper is to endow a monoid structure on the set S of all oriented knots(links) under the operation ⊎ , called addition of knots. Moreover, we prove that there exists a homomorphism of monoids between (Sd, ⊎ ) to (N, +), where Sd is a subset of S with an extra condition and N is the monoid of non negative integers under usual addition.

متن کامل

The Crossing Number of Composite Knots

One of the most basic questions in knot theory remains unresolved: is crossing number additive under connected sum? In other words, does the equality c(K1♯K2) = c(K1) + c(K2) always hold, where c(K) denotes the crossing number of a knot K and K1♯K2 is the connected sum of two (oriented) knots K1 and K2? The inequality c(K1♯K2) ≤ c(K1) + c(K2) is trivial, but very little more is known in general...

متن کامل

Triple Crossing Number of Knots and Links

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c3(K), which is the minimum number of triple crossings in a projection of K. We o...

متن کامل

Doubly slice knots with low crossing number

A knot in S is doubly slice if it is the cross-section of an unknotted two-sphere in S. For low-crossing knots, the most complete work to date gives a classification of doubly slice knots through 9 crossings. We extend that work through 12 crossings, resolving all but four cases among the 2,977 prime knots in that range. The techniques involved in this analysis include considerations of the Ale...

متن کامل

Odd Crossing Number Is Not Crossing Number

The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the number of pairs of edges that intersect an odd number of times, we obtain the odd crossing number. We show that there is a graph for which these two concepts differ, answering a well-known open question on crossing numbe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Knot Theory and Its Ramifications

سال: 2012

ISSN: 0218-2165,1793-6527

DOI: 10.1142/s0218216512501039